Stanford ’ s Distantly Supervised Slot Filling Systems for KBP 2014
نویسندگان
چکیده
We describe Stanford’s entry in the TACKBP 2014 Slot Filling challenge. We submitted two broad approaches to Slot Filling, both strongly based on the ideas of distant supervision: one built on the DeepDive framework (Niu et al., 2012), and another based on the multi-instance multilabel relation extractor of Surdeanu et al. (2012). In addition, we evaluate the impact of learned and hard-coded patterns on performance for slot filling, and the impact of the partial annotations described in Angeli et al. (2014).
منابع مشابه
Combining Distant and Partial Supervision for Relation Extraction
Broad-coverage relation extraction either requires expensive supervised training data, or suffers from drawbacks inherent to distant supervision. We present an approach for providing partial supervision to a distantly supervised relation extractor using a small number of carefully selected examples. We compare against established active learning criteria and propose a novel criterion to sample ...
متن کاملStanford at TAC KBP 2016: Sealing Pipeline Leaks and Understanding Chinese
We describe Stanford’s entries in the TAC KBP 2016 Cold Start Slot Filling and Knowledge Base Population challenge. Our biggest contribution is an entirely new Chinese entity detection and relation extraction system for the new Chinese and cross-lingual relation extraction tracks. This new system consists of several ruled-based relation extractors and a distantly supervised extractor. We also a...
متن کاملUsing a weakly supervised approach and lexical patterns for the KBP slot filling task
We present in this article the system we developed for participating to the slot filling task in the Knowledge Base Population (KBP) track of the 2011 Text Analysis Conference (TAC). This system is based on a weakly supervised approach and lexical patterns. In this participation, we tested more specifically the integration of an additional unsupervised relation identification component dedicate...
متن کاملStanford-UBC at TAC-KBP
This paper describes the joint Stanford-UBC knowledge base population system. We developed several entity linking systems based on frequencies of backlinks, training on contexts of anchors, overlap of context with the text of the entity in Wikipedia, and both heuristic and supervised combinations. Our combined systems performed better than the individual components, which situates our runs bett...
متن کاملA distant supervised learning system for the TAC-KBP Slot Filling and Temporal Slot Filling Tasks
This paper describes the system implemented by the NLP GROUP AT UNED for our first participation in the Knowledge Base Population at the Text Analysis Conference (TACKBP). For this Slot Filling Task, our approach was to design a distant supervised learning system, which was then specialized for the Regular Slot Filling and Full Temporal Slot Filling subtasks. From the initial Knowledge Base and...
متن کامل